Practical Fast Clock-Schedule Design Algorithms
نویسندگان
چکیده
منابع مشابه
Practical Fast Clock-Schedule Design Algorithms
SUMMARY In this paper, a practical clock-scheduling engine is introduced. The minimum feasible clock-period is obtained by using a modified Bellman-Ford shortest path algorithm. Then an optimum cost clock-schedule is obtained by using a bipartite matching algorithm. It also provides useful information to circuit synthesis tools. The experiment to a circuit with about 10000 registers and 100000 ...
متن کاملPractical design for transferring signals between clock domains
With the increasing integration of multiple systems on single SOCs (systems on chip) or boards, multiple clock frequencies in single digital designs have become common. Because of the asynchronous nature of these designs, passing data or control signals between logic operating on different clock frequencies presents a special set of problems. Because asynchronous design is unfamiliar to most ex...
متن کاملAirline Schedule Planning: Integrated Models and Algorithms for Schedule Design and Fleet Assignment
C a profitable schedule is of utmost importance to an airline because its profitability is critically influenced by its flight offerings. We focus our attention on the steps of the airline schedule planning process involving schedule design and fleet assignment. Airline schedule design involves determining when and where to offer flights such that profits are maximized, and fleet assignment inv...
متن کاملFast search algorithms for computational protein design
One of the main challenges in computational protein design (CPD) is the huge size of the protein sequence and conformational space that has to be computationally explored. Recently, we showed that state-of-the-art combinatorial optimization technologies based on Cost Function Network (CFN) processing allow speeding up provable rigid backbone protein design methods by several orders of magnitude...
متن کاملHierarchical design of fast Minimum Disagreement algorithms
We compose a toolbox for the design of Minimum Disagreement algorithms. This box contains general procedures which transform (without much loss of efficiency) algorithms that are successful for some d-dimensional (geometric) concept class C into algorithms which are successful for a (d+ 1)-dimensional extension of C. An iterative application of these transformations has the potential of startin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2006
ISSN: 0916-8508,1745-1337
DOI: 10.1093/ietfec/e89-a.4.1005